Using graphics hardware to speed-up your visibility queries
نویسندگان
چکیده
We present a visibility method that takes advantage of the graphics hardware to give fast answers to visibility queries. Our visibility method is designed to solve two types of visibility queries: point-based visibility queries, where several visibility queries share the same origin, and planebased visibility queries, where several visibility queries have their origins on the same plane. Both occur frequently in global illumination algorithms. Combining the speed given by graphics hardware with a software heuristic to avoid reliability problems, our visibility method is significantly faster than ray-casting, and still gives the same results.
منابع مشابه
OpenGL-assisted Visibility Queries of Large Polygonal Models
We present an OpenGL-assisted visibility culling algorithm to improve the rendering performance of large polygonal models. Using a combination of OpenGL-assisted frustum culling, hierarchical model-space partitioning, and OpenGL based occlusion culling, we achieve a significant better performance on general polygonal models than previous approaches. In contrast to these approaches, we only expl...
متن کاملHardware-assisted View-dependent Isosurface Extraction using Spherical Partition
Extracting only the visible portion of an isosurface can improve both the computation efficiency and the rendering speed. However, the visibility test overhead can be quite high for large scale data sets. In this paper, we present a view-dependent isosurface extraction algorithm utilizing occlusion query hardware to accelerate visible isosurface extraction. A spherical partition scheme is propo...
متن کاملVisibility Computations for Real-Time Rendering in General 3D Environments
Visibility computations are essential operations in computer graphics, which are required for rendering acceleration in the form of visibility culling, as well as for computing realistic lighting. Visibility culling, which is the main focus of this thesis, aims to provide output sensitivity by sending only visible primitives to the hardware. Regardless of the rapid development of graphics hardw...
متن کاملEfficient Conservative Visibility Culling Using the Prioritized-Layered Projection Algorithm
We propose a novel conservative visibility culling technique based on the Prioritized-Layered Projection (PLP) algorithm. PLP is a time-critical rendering technique that computes, for a given viewpoint, a partially correct image by rendering only a subset of the geometric primitives, those that PLP determines to be mostly likely visible. Our new algorithm builds on PLP and provides an efficient...
متن کاملRay Space Factorization for From-Region Visibility
From-region visibility culling is considered significantly harder than from-point visibility culling, since it is inherently 4dimensional. We present a conservative occlusion culling method based on factorizing the 4D visibility problem into horizontal and vertical components. The visibility of the two components is solved asymmetrically: the horizontal component is based on a novel parameteriz...
متن کامل